A Simply Stabilized Running Model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simply Stabilized Running Model

The spring-loaded inverted pendulum (SLIP), or monopedal hopper, is an archetypal model for running in numerous animal species. Although locomotion is generally considered a complex task requiring sophisticated control strategies to account for coordination and stability, we show that stable gaits can be found in the SLIP with both linear and "air" springs, controlled by a simple fixed-leg rese...

متن کامل

Symbolic model checking of simply-timed systems

We propose OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be arbitrary natural numbers. A simple and natural semantics for these systems opens the way for improved efficiency. Our algorithms have been implemented in nuSMV and perform well in practice (on standard case studies).

متن کامل

Symbolic Model Checking for Simply-Timed Systems

We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be arbitrary natural numbers. A simple and natural semantics for these systems opens the way for improved efficiency. Our algorithms have been implemented in NuSMV and perform well in practice (on standard case studies).

متن کامل

Why don ’ t we simply use a model checker ?

Teaching formal methods is notoriously difficult but it is also often argued that formal methods needs to be supported by adequate tools to get better acceptance from the students. In this paper, we focus on teaching a strict programming methodology for imperative program construction, using specifications (i.e., pre/post conditions), invariants, variants (for termination proofs), and decomposi...

متن کامل

A bigraphical model of the simply typed λ-calculus

We present a model of the simply typed λ-calculus as a simply typed explicit substitution calculus encoded in a bigraphical reactive system. The reactive system combines a previous model by Milner with a sorting of the place graph structure which is defined using a generalisation of our previous work on kind sortings. The model demonstrates the expressiveness of these sortings. We identify some...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Review

سال: 2005

ISSN: 0036-1445,1095-7200

DOI: 10.1137/050626594